Data replication in static tree structures

right Replication of data can lead to better performance due to increased availability of data. This paper explores the use of data replication for large, static data sets organized in a tree structure. In static environments, data replication does not have to deal with problems arising from maintaining consistency among copies [1,10,12]. Static data sets arise, for example, when updates on the data happen at fixed times and in bulk, and queries are not present at the time of updating. We show that in static tree structures data replication is effective in reducing the amount of I/O needed measured in terms of the blocknumber. Our techniques determine what data to replicate, how to control the amount of replication, and how to ensure good block utilization. Our results improve previously known bounds.